K4-free Graphs as a Free Algebra
نویسندگان
چکیده
Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition to parallel composition and series composition, it suffices to consider the neutral elements of those operations and a unary transpose operation. Then we give a finite equational presentation and we prove it complete: two terms from the syntax are congruent if and only if they denote the same graph.
منابع مشابه
On Stable Cutsets in Claw-Free Graphs and Planar Graphs
A stable cutset in a connected graph is a stable set whose deletion disconnects the graph. Let K4 and K1,3 (claw) denote the complete (bipartite) graph on 4 and 1+ 3 vertices. It is NP-complete to decide whether a line graph (hence a claw-free graph) with maximum degree five or a K4-free graph admits a stable cutset. Here we describe algorithms deciding in polynomial time whether a claw-free gr...
متن کاملHomomorphism bounds and edge-colourings of K4-minor-free graphs
We present a necessary and sufficient condition for a graph of odd-girth 2k + 1 to bound the class of K4-minor-free graphs of odd-girth (at least) 2k + 1, that is, to admit a homomorphism from any such K4-minor-free graph. This yields a polynomial-time algorithm to recognize such bounds. Using this condition, we first prove that every K4-minor free graph of odd-girth 2k+1 admits a homomorphism ...
متن کاملDensity of universal classes of series-parallel graphs
A class of graphs C ordered by the homomorphism relation is universal if every countable partial order can be embedded in C. It was shown in [1] that the class Ck of k-colorable graphs, for any fixed k ≥ 3, induces a universal partial order. In [4], a surprisingly small subclass of C3 which is a proper subclass of K4-minor-free graphs (G/K4) is shown to be universal. In another direction, a den...
متن کاملColoring (P6, diamond, K4)-free graphs
We show that every (P6, diamond, K4)-free graph is 6-colorable. Moreover, we give an example of a (P6, diamond, K4)-free graph G with χ(G) = 6. This generalizes some known results in the literature.
متن کاملChoosability of Squares of K4-minor Free Graphs
Lih, Wang and Zhu [Discrete Math. 269 (2003), 303–309] proved that the chromatic number of the square of a K4-minor free graph with maximum degree ∆ is bounded by ⌊3∆/2⌋+1 if ∆ ≥ 4, and is at most ∆+3 for ∆ ∈ {2, 3}. We show that the same bounds hold for the list chromatic number of squares of K4-minor free graphs. The same result was also proved independently by Hetherington and Woodall.
متن کامل